Harmonic analysis of finite lamplighter random walks
نویسندگان
چکیده
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In the case the graph has a transitive isometry group G, we also describe the spectral analysis in terms of the representation theory of the wreath product C2 ≀ G. We apply our theory to the lamplighter random walks on the complete graph and on the discrete circle. These examples were already studied by Haggstrom and Jonasson by probabilistic methods. 1
منابع مشابه
Positive Harmonic Functions for Semi-isotropic Random Walks on Trees, Lamplighter Groups, and Dl-graphs
We determine all positive harmonic functions for a large class of “semiisotropic” random walks on the lamplighter group, i.e., the wreath product Zq ≀Z, where q ≥ 2. This is possible via the geometric realization of a Cayley graph of that group as the Diestel-Leader graph DL(q, q). More generally, DL(q, r) (q, r ≥ 2) is the horocyclic product of two homogeneous trees with respective degrees q+1...
متن کاملThe Poisson Boundary of Lamplighter Random Walks on Trees
Let Tq be the homogeneous tree with degree q + 1 ≥ 3 and G a finitely generated group whose Cayley graph is Tq. The associated lamplighter group is the wreath product Zr ≀ G, where Zr is the cyclic group of order r. For a large class of random walks on this group, we prove almost sure convergence to a natural geometric boundary. If the probability law governing the random walk has finite first ...
متن کاملThe Spectra of Lamplighter Groups and Cayley Machines
We calculate the spectra and spectral measures associated to random walks on restricted wreath products G wr Z, with G a finite abelian group, by realizing them as groups generated by automata. This generalizes the work of Grigorchuk and Żuk on the lamplighter group. More generally we calculate the spectra of random walks on groups generated by Cayley machines of finite groups and calculate Kes...
متن کاملLamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions
The lamplighter group over Z is the wreath product Zq ≀ Z. With respect to a natural generating set, its Cayley graph is the Diestel-Leader graph DL(q, q). We study harmonic functions for the “simple” Laplacian on this graph, and more generally, for a class of random walks on DL(q, r), where q, r ≥ 2. The DL-graphs are horocyclic products of two trees, and we give a full description of all posi...
متن کاملA note on the Poisson boundary of lamplighter random walks
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups Γ endowed with a “rich” boundary. The starting point is the Strip Criterion of identification of the Poisson boundary for random walks on discrete groups due to Kaimanovich [16]. A geometrical method for constructing the strip as a subset of the lamplighter group ...
متن کامل